// Copyright (C) 2005 Taylor L. Riché <riche@cs.utexas.edu>
//  
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
// 
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
// 
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software 
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
//
// 	$Id: Scheduler.cc 410 2006-05-26 16:25:26Z richetl $	
//

#include "ApplicationGraph.hh"
#include "Scheduler.hh"

using namespace lee;

ProcUnit *
Scheduler::getProcUnit(PCon * pcon)
{
  Synchronized::Scope mutex(this);
  ProcUnit * proc;
  assert(pcon->getFunction() != NULL);
  while((proc = composableMap[pcon->getFunction()->getName()]) == NULL) {
    wait();
  }
  return proc;
}

void 
Scheduler::schedule(std::list<ProcUnit *> & p, Container & cont, bool first = false)
{
  if(first == true) {
    pList = &p;
    currPU = pList->begin();
  }
//   try {
//     Module & fakemod = dynamic_cast<Module &>(cont);
//   }
//   catch (std::bad_cast) {
//   }
  //  assert(cont.getSet());
  cont.checkSet();
  for(std::map<std::string, Composable*>::iterator i = cont.composableMap.begin();
      i != cont.composableMap.end(); i++) {
//     composableMap[(*i).second->getName()] = *j;
//     j++;
//     if(j == pList->end()) {
//       j = pList->begin();
//     }
//    addComp(i->second);
    Module * mod = dynamic_cast<Module *>(i->second);
    if(mod == NULL) {
      Function * func = dynamic_cast<Function *>(i->second);
      setPU(func);
    }
    else if (mod != &cont) {
      this->schedule(p, *mod);
    }
  }

//  currPU = j;
    
  return;
}

void
Scheduler::setPU(Function * func)
{
  assert(!func->isScheduled());
  if(!func->isScheduled()) {
    func->schedule(*currPU);
    func->setKeys(exitKey, eventKey);
    currPU++;
    if(currPU == pList->end()) {
      currPU = pList->begin();
    }
  }
  return;
}

void
Scheduler::assignNewProc(Function * func)
{
  std::ostringstream oss;
  oss << func->getName() << ":" << *currPU << std::endl;
  log.write(oss.str());
  func->schedule(*currPU);
  currPU++;
  if(currPU == pList->end()) {
    currPU = pList->begin();
  }
  return;
}
